<HTML><HEAD><TITLE>matching(+L, -K)</TITLE>
</HEAD><BODY>[ <A HREF="index.html">library(ic_global_gac)</A> | <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]
<H1>matching(+L, -K)</H1>
Get a matching between a list of domain variables and their possible values
<DL>
<DT><EM>L</EM></DT>
<DD>A list of integers or domain variables, or a collection a la collection_to_list/2
</DD>
<DT><EM>K</EM></DT>
<DD>A free variable, will be bound to a list of integers
</DD>
</DL>
<H2>Description</H2>
This predicate can be used to get the matching into the user program. Sometimes it is a good starting point for heuristics. It only gets the current matching and does not do any propagation, the matching is not updated when values are removed, the predicate must be called again in the user program if this is required
<H3>Fail Conditions</H3>
The predicate fails if no matching exists
<H2>See Also</H2>
<A HREF="../../lib_public/ic_global_gac/alldifferent-1.html">alldifferent / 1</A>
</BODY></HTML>
